Term Rewriting with Logical Constraints
Identifieur interne : 001471 ( Main/Exploration ); précédent : 001470; suivant : 001472Term Rewriting with Logical Constraints
Auteurs : Cynthia Kop [Autriche] ; Naoki Nishida [Japon]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: In recent works on program analysis, transformations of various programming languages to term rewriting are used. In this setting, constraints appear naturally. Several definitions which combine rewriting with logical constraints, or with separate rules for integer functions, have been proposed. This paper seeks to unify and generalise these proposals.
Url:
DOI: 10.1007/978-3-642-40885-4_24
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002E92
- to stream Istex, to step Curation: 002E54
- to stream Istex, to step Checkpoint: 000097
- to stream Main, to step Merge: 001483
- to stream Main, to step Curation: 001471
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Term Rewriting with Logical Constraints</title><author><name sortKey="Kop, Cynthia" sort="Kop, Cynthia" uniqKey="Kop C" first="Cynthia" last="Kop">Cynthia Kop</name></author><author><name sortKey="Nishida, Naoki" sort="Nishida, Naoki" uniqKey="Nishida N" first="Naoki" last="Nishida">Naoki Nishida</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:C5A700FFCEA77C6FC8065FB57B8C5B49BFF0FAE2</idno><date when="2013" year="2013">2013</date><idno type="doi">10.1007/978-3-642-40885-4_24</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-3PHVJG56-X/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002E92</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002E92</idno><idno type="wicri:Area/Istex/Curation">002E54</idno><idno type="wicri:Area/Istex/Checkpoint">000097</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000097</idno><idno type="wicri:doubleKey">0302-9743:2013:Kop C:term:rewriting:with</idno><idno type="wicri:Area/Main/Merge">001483</idno><idno type="wicri:Area/Main/Curation">001471</idno><idno type="wicri:Area/Main/Exploration">001471</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Term Rewriting with Logical Constraints</title><author><name sortKey="Kop, Cynthia" sort="Kop, Cynthia" uniqKey="Kop C" first="Cynthia" last="Kop">Cynthia Kop</name><affiliation wicri:level="1"><country xml:lang="fr">Autriche</country><wicri:regionArea>Department of Computer Science, University of Innsbruck, Technikerstraße 21a, 6020, Innsbruck</wicri:regionArea><wicri:noRegion>Innsbruck</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Autriche</country></affiliation></author><author><name sortKey="Nishida, Naoki" sort="Nishida, Naoki" uniqKey="Nishida N" first="Naoki" last="Nishida">Naoki Nishida</name><affiliation wicri:level="1"><country xml:lang="fr">Japon</country><wicri:regionArea>Graduate School of Information Science, Nagoya University, Furo-cho, Chikusa-ku, 4648603</wicri:regionArea><wicri:noRegion>4648603</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Japon</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: In recent works on program analysis, transformations of various programming languages to term rewriting are used. In this setting, constraints appear naturally. Several definitions which combine rewriting with logical constraints, or with separate rules for integer functions, have been proposed. This paper seeks to unify and generalise these proposals.</div></front></TEI><affiliations><list><country><li>Autriche</li><li>Japon</li></country></list><tree><country name="Autriche"><noRegion><name sortKey="Kop, Cynthia" sort="Kop, Cynthia" uniqKey="Kop C" first="Cynthia" last="Kop">Cynthia Kop</name></noRegion><name sortKey="Kop, Cynthia" sort="Kop, Cynthia" uniqKey="Kop C" first="Cynthia" last="Kop">Cynthia Kop</name></country><country name="Japon"><noRegion><name sortKey="Nishida, Naoki" sort="Nishida, Naoki" uniqKey="Nishida N" first="Naoki" last="Nishida">Naoki Nishida</name></noRegion><name sortKey="Nishida, Naoki" sort="Nishida, Naoki" uniqKey="Nishida N" first="Naoki" last="Nishida">Naoki Nishida</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001471 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001471 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:C5A700FFCEA77C6FC8065FB57B8C5B49BFF0FAE2
|texte= Term Rewriting with Logical Constraints
}}
| This area was generated with Dilib version V0.6.33. |  |